Dining cryptographers problem

Results: 17



#Item
11CS255: Cryptography and Computer Security  Winter 1998 Final Exam

CS255: Cryptography and Computer Security Winter 1998 Final Exam

Add to Reading List

Source URL: crypto.stanford.edu

Language: English - Date: 2000-03-02 16:04:37
12CS255: Cryptography and Computer Security  Winter 1998 Final Exam

CS255: Cryptography and Computer Security Winter 1998 Final Exam

Add to Reading List

Source URL: crypto.stanford.edu

Language: English - Date: 2002-03-13 15:29:31
13A 2-Round Anonymous Veto Protocol A new solution to the dining cryptographers problem Speaker: Feng Hao Computer Laboratory University of Cambridge

A 2-Round Anonymous Veto Protocol A new solution to the dining cryptographers problem Speaker: Feng Hao Computer Laboratory University of Cambridge

Add to Reading List

Source URL: homepages.cs.ncl.ac.uk

Language: English - Date: 2007-07-03 13:14:36
14The Power of Anonymous Veto in Public Discussion Feng Hao1 and Piotr Zieli´ nski2, 1

The Power of Anonymous Veto in Public Discussion Feng Hao1 and Piotr Zieli´ nski2, 1

Add to Reading List

Source URL: homepages.cs.ncl.ac.uk

Language: English - Date: 2010-04-10 14:54:54
15LNCS[removed]Elections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA

LNCS[removed]Elections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA

Add to Reading List

Source URL: www.cs.elte.hu

Language: English - Date: 2006-03-02 14:49:50
16New Directions for Dining Cryptographers Computationally Secure Sender and Recipient Untraceability

New Directions for Dining Cryptographers Computationally Secure Sender and Recipient Untraceability

Add to Reading List

Source URL: secan-lab.uni.lu

Language: English - Date: 2013-02-21 08:25:54
17J. Cryptology[removed]:[removed]Journal of Cryptology

J. Cryptology[removed]:[removed]Journal of Cryptology

Add to Reading List

Source URL: www.cs.ucsb.edu

Language: English - Date: 2007-03-31 14:33:35